BANDED SURFACES, BANDED LINKS, BAND INDICES AND GENERA OF LINKS
نویسندگان
چکیده
منابع مشابه
Groups of banded matrices with banded inverses
AproductADF1 : : : FN of invertible block-diagonalmatrices will be bandedwith a banded inverse. We establish this factorization with the numberN controlled by the bandwidthsw and not by the matrix size n:When A is an orthogonal matrix, or a permutation, or banded plus finite rank, the factors Fi have w D 1 and generate that corresponding group. In the case of infinite matrices, conjectures rema...
متن کاملFast transforms: Banded matrices with banded inverses.
It is unusual for both A and A(-1) to be banded--but this can be a valuable property in applications. Block-diagonal matrices F are the simplest examples; wavelet transforms are more subtle. We show that every example can be factored into A = F(1)...F(N) where N is controlled by the bandwidths of A and A(-1) (but not by their size, so this extends to infinite matrices and leads to new matrix gr...
متن کاملBanded Matrices with Banded Inverses and A = LPU
Abstract. If A is a banded matrix with a banded inverse, then A = BC = F1 . . . FN is a product of block-diagonal matrices. We review this factorization, in which the Fi are tridiagonal and N is independent of the matrix size. For a permutation with bandwidth w, each Fi exchanges disjoint pairs of neighbors and N < 2w. This paper begins the extension to infinite matrices. For doubly infinite pe...
متن کاملThe topographic structure of Giemsa banded (G-banded) early met
The topographic structure of Giemsa banded (G-banded) early metaphase human chromosomes adsorbed on glass was analyzed by atomic force microscope using amplitude modulation mode [AMAFM]. Longitudinal height measurements for early metaphasic human chromosomes showed a central ridge that was further characterized by transversal height measurements. The heterochromatic regions displayed a high lev...
متن کاملFinding Banded Patterns in Data: The Banded Pattern Mining Algorithm
The concept of Banded pattern mining is concerned with the identification of “bandings” within zero-one data. A zero-one data set is said to be fully banded if all the “ones” can be arranged along the leading diagonal. The discovery of a banded pattern is of interest in its own right, at least in a data analysis context, because it tells us something about the data. Banding has also been shown ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Knot Theory and Its Ramifications
سال: 2013
ISSN: 0218-2165,1793-6527
DOI: 10.1142/s0218216513500351